منابع مشابه
Multibiometrics Feature Level Fusion by Graph Clustering
This paper presents a feature level fusion approach which uses the improved K-medoids clustering algorithm and isomorphic graph for face and palmprint biometrics. Partitioning around medoids (PAM) algorithm is used to partition the set of n invariant feature points of the face and palmprint images into k clusters. By partitioning face and palmprint images with scale invariant features SIFT poin...
متن کاملEdge pair sum labeling of spider graph
An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...
متن کاملGeographic and Clustering Routing for Energy Saving in Wireless Sensor Network with Pair of Node Groups
Recently, wireless sensor network (WSN) is the popular scope of research. It uses too many applications such as military and non-military. WSN is a base of the Internet of Things (IoT), pervasive computing. It consists of many nodes which are deployed in a specific filed for sense and forward data to the destination node. Routing in WSN is a very important issue because of the limitation of the...
متن کاملSimultaneous supervised clustering and feature selection over a graph.
In this article, we propose a regression method for simultaneous supervised clustering and feature selection over a given undirected graph, where homogeneous groups or clusters are estimated as well as informative predictors, with each predictor corresponding to one node in the graph and a connecting path indicating a priori possible grouping among the corresponding predictors. The method seeks...
متن کاملSelf-representation based dual-graph regularized feature selection clustering
Feature selection algorithms eliminate irrelevant and redundant features, even the noise, while preserving the most representative features. They can reduce the dimension of the dataset, extract essential features in high dimensional data and improve learning quality. Existing feature selection algorithms are all carried out in data space. However, the information of feature space cannot be ful...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent Systems
سال: 2019
ISSN: 2191-026X,0334-1860
DOI: 10.1515/jisys-2018-0338